package j2024.j202407;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class j0729 {
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        int[] n = new int[t];
        int[] m = new int[t];
        String[] s = new String[t];
        for (int i = 0; i < t; i++) {
            n[i] = in.nextInt();
            m[i] = in.nextInt();
            s[i] = in.next();
        }
        for (int i = 0; i < t; i++) {
            int score = 0;
            int count = 0;
            for (int j = 0; j < n[i]; j++) {
                if(s[i].charAt(j)=='W'){
                    count++;
                    if(count>=3){
                        score+=m[i];
                    }else {
                        score++;
                    }
                }else {
                    score--;
                    count = 0;
                }
            }
            System.out.println(score);
        }
    }

    public int maxLength (int[] arr) {
        // write code here
        HashSet<Integer> set = new HashSet<>();
        for (int i = 0; i < arr.length; i++) {
            set.add(arr[i]);
        }
        return set.size();
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        String s = in.next();
        char[] str = s.toCharArray();
        HashMap<Character,Integer> map = new HashMap<>();
        for (int i = 0; i < str.length; i++) {
            map.put(str[i],map.getOrDefault(str[i],0)+1);
        }
        if(map.size()==1){
            System.out.println("no");
        }else {
            char[] ret = new char[n];
            int x = 0;
            while(true){

            }
        }
    }
}
